Minimizing regret : the general case . ¤ Aldo
نویسنده
چکیده
In repeated games with di®erential information on one side, the labelling \general case" refers to games in which the action of the informed player is not known to the uninformed, who can only observe a signal which is the random outcome of his and his opponent's action. Here we consider the problem of minimizing regret (in the sense ̄rst formulated by Hannan [8]) when the information available is of this type. We give a simple condition describing the approachable set. JEL Classi ̄cation: D81, D82, D83.
منابع مشابه
Minimizing Regret in Discounted-Sum Games
In this paper, we study the problem of minimizing regret in discounted-sum games played on weighted game graphs. We give algorithms for the general problem of computing the minimal regret of the controller (Eve) as well as several variants depending on which strategies the environment (Adam) is permitted to use. We also consider the problem of synthesizing regret-free strategies for Eve in each...
متن کاملComputing k-Regret Minimizing Sets
Regret minimizing sets are a recent approach to representing a dataset D by a small subset R of size r of representative data points. The set R is chosen such that executing any top-1 query on R rather than D is minimally perceptible to any user. However, such a subset R may not exist, even for modest sizes, r. In this paper, we introduce the relaxation to k-regret minimizing sets, whereby a to...
متن کاملMinimax Filtering via Relations between Information and Estimation
We investigate the problem of continuous-time causal estimation under a minimax criterion. Let X = {Xt, 0 ≤ t ≤ T} be governed by the probability law Pθ from a class of possible laws indexed by θ ∈ Λ, and Y T be the noise corrupted observations of X available to the estimator. We characterize the estimator minimizing the worst case regret, where regret is the difference between the causal estim...
متن کاملOnline Learning with Transductive Regret
We study online learning with the general notion of transductive regret, that is regret with modification rules applying to expert sequences (as opposed to single experts) that are representable by weighted finite-state transducers. We show how transductive regret generalizes existing notions of regret, including: (1) external regret; (2) internal regret; (3) swap regret; and (4) conditional sw...
متن کاملMinimizing Wide Range Regret with Time Selection Functions
We consider the problem of minimizing regret with respect to a given set S of pairs of time selection functions and modifications rules. We give an online algorithm that has O( √ T log |S|) regret with respect to S when the algorithm is run for T time steps and there are N actions allowed. This improves the upper bound of O( √ TN log(|I||F|)) given by Blum and Mansour [BM07a] for the case when ...
متن کامل